38 research outputs found

    The weighted independent domination problem: ILP model and algorithmic approaches

    Get PDF
    This work deals with the so-called weighted independent domination problem, which is an N P -hard combinatorial optimization problem in graphs. In contrast to previous theoretical work from the liter- ature, this paper considers the problem from an algorithmic perspective. The first contribution consists in the development of an integer linear programming model and a heuristic that makes use of this model. Sec- ond, two greedy heuristics are proposed. Finally, the last contribution is a population-based iterated greedy algorithm that takes profit from the better one of the two developed greedy heuristics. The results of the compared algorithmic approaches show that small problem instances based on random graphs are best solved by an efficient integer linear programming solver such as CPLEX. Larger problem instances are best tackled by the population-based iterated greedy algorithm. The experimental evaluation considers random graphs of different sizes, densities, and ways of generating the node and edge weights

    The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches

    Get PDF
    This work deals with the so-called weighted independent domination problem, which is an NPNP-hard combinatorial optimization problem in graphs. In contrast to previous work, this paper considers the problem from a non-theoretical perspective. The first contribution consists in the development of three integer linear programming models. Second, two greedy heuristics are proposed. Finally, the last contribution is a population-based iterated greedy metaheuristic which is applied in two different ways: (1) the metaheuristic is applied directly to each problem instance, and (2) the metaheuristic is applied at each iteration of a higher-level framework---known as construct, merge, solve \& adapt---to sub-instances of the tackled problem instances. The results of the considered algorithmic approaches show that integer linear programming approaches can only compete with the developed metaheuristics in the context of graphs with up to 100 nodes. When larger graphs are concerned, the application of the populated-based iterated greedy algorithm within the higher-level framework works generally best. The experimental evaluation considers graphs of different types, sizes, densities, and ways of generating the node and edge weights

    Pathogenesis of progressive scarring trachoma in Ethiopia and Tanzania and its implications for disease control: two cohort studies.

    Get PDF
    BACKGROUND: Trachoma causes blindness through a conjunctival scarring process initiated by ocular Chlamydia trachomatis infection; however, the rates, drivers and pathophysiological determinants are poorly understood. We investigated progressive scarring and its relationship to conjunctival infection, inflammation and transcript levels of cytokines and fibrogenic factors. METHODOLOGY/PRINCIPAL FINDINGS: We recruited two cohorts, one each in Ethiopia and Tanzania, of individuals with established trachomatous conjunctival scarring. They were followed six-monthly for two years, with clinical examinations and conjunctival swab sample collection. Progressive scarring cases were identified by comparing baseline and two-year photographs, and compared to individuals without progression. Samples were tested for C. trachomatis by PCR and transcript levels of S100A7, IL1B, IL13, IL17A, CXCL5, CTGF, SPARCL1, CEACAM5, MMP7, MMP9 and CD83 were estimated by quantitative RT-PCR. Progressive scarring was found in 135/585 (23.1%) of Ethiopian participants and 173/577 (30.0%) of Tanzanian participants. There was a strong relationship between progressive scarring and increasing inflammatory episodes (Ethiopia: OR 5.93, 95%CI 3.31-10.6, p<0.0001. Tanzania: OR 5.76, 95%CI 2.60-12.7, p<0.0001). No episodes of C. trachomatis infection were detected in the Ethiopian cohort and only 5 episodes in the Tanzanian cohort. Clinical inflammation, but not scarring progression, was associated with increased expression of S100A7, IL1B, IL17A, CXCL5, CTGF, CEACAM5, MMP7, CD83 and reduced SPARCL1. CONCLUSIONS/SIGNIFICANCE: Scarring progressed in the absence of detectable C. trachomatis, which raises uncertainty about the primary drivers of late-stage trachoma. Chronic conjunctival inflammation appears to be central and is associated with enriched expression of pro-inflammatory factors and altered expression of extracellular matrix regulators. Host determinants of scarring progression appear more complex and subtle than the features of inflammation. Overall this indicates a potential role for anti-inflammatory interventions to interrupt progression and the need for trichiasis disease surveillance and surgery long after chlamydial infection has been controlled at community level

    Population-level risks of alcohol consumption by amount, geography, age, sex, and year: a systematic analysis for the Global Burden of Disease Study 2020

    Get PDF
    Background The health risks associated with moderate alcohol consumption continue to be debated. Small amounts of alcohol might lower the risk of some health outcomes but increase the risk of others, suggesting that the overall risk depends, in part, on background disease rates, which vary by region, age, sex, and year. Methods For this analysis, we constructed burden-weighted dose–response relative risk curves across 22 health outcomes to estimate the theoretical minimum risk exposure level (TMREL) and non-drinker equivalence (NDE), the consumption level at which the health risk is equivalent to that of a non-drinker, using disease rates from the Global Burden of Diseases, Injuries, and Risk Factors Study (GBD) 2020 for 21 regions, including 204 countries and territories, by 5-year age group, sex, and year for individuals aged 15–95 years and older from 1990 to 2020. Based on the NDE, we quantified the population consuming harmful amounts of alcohol. Findings The burden-weighted relative risk curves for alcohol use varied by region and age. Among individuals aged 15–39 years in 2020, the TMREL varied between 0 (95% uncertainty interval 0–0) and 0·603 (0·400–1·00) standard drinks per day, and the NDE varied between 0·002 (0–0) and 1·75 (0·698–4·30) standard drinks per day. Among individuals aged 40 years and older, the burden-weighted relative risk curve was J-shaped for all regions, with a 2020 TMREL that ranged from 0·114 (0–0·403) to 1·87 (0·500–3·30) standard drinks per day and an NDE that ranged between 0·193 (0–0·900) and 6·94 (3·40–8·30) standard drinks per day. Among individuals consuming harmful amounts of alcohol in 2020, 59·1% (54·3–65·4) were aged 15–39 years and 76·9% (73·0–81·3) were male. Interpretation There is strong evidence to support recommendations on alcohol consumption varying by age and location. Stronger interventions, particularly those tailored towards younger individuals, are needed to reduce the substantial global health loss attributable to alcohol. Funding Bill & Melinda Gates Foundation

    The Weighted Independent Domination Problem: ILP Model and Algorithmic Approaches

    No full text
    This work deals with the so-called weighted independent domination problem, which is an NP-hard combinatorial optimization problem in graphs. In contrast to previous theoretical work from the literature, this paper considers the problem from an algorithmic perspective. The first contribution consists in the development of an integer linear programming model and a heuristic that makes use of this model. Second, two greedy heuristics are proposed. Finally, the last contribution is a population-based iterated greedy algorithm that takes profit from the better one of the two developed greedy heuristics. The results of the compared algorithmic approaches show that small problem instances based on random graphs are best solved by an efficient integer linear programming solver such as CPLEX. Larger problem instances are best tackled by the population-based iterated greedy algorithm. The experimental evaluation considers random graphs of different sizes, densities, and ways of generating the node and edge weights. © Springer International Publishing AG 2017.This work was supported by project TIN2012-37930-C02-02 (Spanish Ministry for Economy and Competitiveness, FEDER funds from the European Union)Peer Reviewe
    corecore